Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
431	. Comparing Approximation Techniques to Continuous-Time Stochastic Dynamic Programming Problems: Applications to Natural Resource Modeling Add to Reading List Source URL: www.acera.unimelb.edu.au Language: English - Date: 2012-04-04 21:51:13 Equations Cybernetics Mathematical optimization Optimal control Partial differential equations Hamilton–Jacobi–Bellman equation Bellman equation Control theory Systems theory Dynamic programming
432	840 JOURNAL OF PHYSICAL OCEANOGRAPHY VOLUME 42 Add to Reading List Source URL: www.eawag.ch Language: English - Date: 2012-05-29 05:02:56 Fluid mechanics Plasma physics Stability theory Atmospheric thermodynamics Convection Instability Boussinesq approximation Atmospheric convection Physics Fluid dynamics Dynamics
433	Discrepancy Bounds for Mixed Sequences Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, 10027 NY, USA email: [removed] Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2009-12-01 06:17:11 Applied mathematics Diophantine approximation Probabilistic complexity theory Low-discrepancy sequence Quasi-Monte Carlo method Monte Carlo method Randomized algorithm Mathematics Randomness Numerical analysis
434	A NEW APPROACH TO STRONG EMBEDDINGS arXiv:0711.0501v3 [math.PR] 1 Jul 2010 SOURAV CHATTERJEE Abstract. We revisit strong approximation theory from a new perspective, culminating in a proof of the Koml´ Add to Reading List Source URL: www-stat.wharton.upenn.edu Language: English - Date: 2013-12-08 15:37:03 Normal distribution Operator theory Central limit theorem Fourier transform Mathematical analysis Statistics Mathematics
435	Weighted L2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, 10027 NY, USA Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2009-12-01 06:16:53 Hilbert space Linear algebra Operator theory Sigma-algebra Measure Lebesgue measure Radon–Nikodym theorem Abelian von Neumann algebra Mathematical analysis Mathematics Measure theory
436	HERMITE-HADAMARD TYPE INEQUALITIES OBTAINED VIA RIEMANN-LIOUVILLE FRACTIONAL CALCULUS M. V. MIHAI and F-C. MITROI Abstract. We extend some inequalities obtained by M. A. Latif to the framework of Riemann-Liouville fracti Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2014-03-17 09:25:32 Integral transforms Riemann–Liouville integral Diophantine approximation Transcendental numbers Operator theory Liouville number Spectral theory of ordinary differential equations Mathematical analysis Mathematics Fractional calculus
437	A robust implementation of the Carath´eodory-Fej´er method Joris Van Deun and Lloyd N. Trefethen June 8, 2010 Abstract Add to Reading List Source URL: eprints.maths.ox.ac.uk Language: English - Date: 2010-06-09 07:21:48 Mathematical series Approximation theory Complex analysis Polynomials Chebyshev polynomials Rational function Taylor series Remez algorithm Pi Mathematical analysis Mathematics Numerical analysis
438	d02 – Ordinary Differential d02uec NAG Library Function Document nag_ode_bvp_ps_lin_solve (d02uec) Add to Reading List Source URL: www.nag.com Language: English - Date: 2014-01-21 11:24:56 Mathematics Approximation theory Orthogonal polynomials Chebyshev polynomials Printf format string Spectral method Scanf format string Numerical analysis Mathematical analysis C Standard Library
439	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
440	ANYTIME ALGORITHMS FOR ROBDD SYMMETRY DETECTION AND APPROXIMATION a thesis submitted to The University of Kent at Canterbury in the subject of computer science Add to Reading List Source URL: www.digit-labs.org Language: English - Date: 2008-09-04 12:58:00 Analysis of algorithms Symmetry Probabilistic complexity theory Algorithm Approximation algorithm Anytime algorithm Time complexity Randomized algorithm Theoretical computer science Applied mathematics Computational complexity theory

UPDATE